Fast Edge-Based Stereo Matching Algorithms through Search Space Reduction

نویسندگان

  • Payman MOALLEM
  • Karim FAEZ
  • Javad HADDADNIA
چکیده

Finding corresponding edges is considered being the most difficult part of edge-based stereo matching algorithms. Usually, correspondence for a feature point in the first image is obtained by searching in a predefined region of the second image, based on epipolar line and maximum disparity. Reduction of search region can increase performances of the matching process, in the context of execution time and accuracy. Traditionally, hierarchical multiresolution techniques, as the fastest methods are used to decrease the search space and therefore increase the processing speed. Considering maximum of directional derivative of disparity in real scenes, we formulated some relations between maximum search space in the second images with respect to relative displacement of connected edges (as the feature points), in successive scan lines of the first images. Then we proposed a new matching strategy to reduce the search space for edge-based stereo matching algorithms. Afterward, we developed some fast stereo matching algorithms based on the proposed matching strategy and the hierarchical multiresolution techniques. The proposed algorithms have two stages: feature extraction and feature matching. We applied these new algorithms on some stereo images and compared their results with those of some hierarchical multiresolution ones. The execution times of our proposed methods are decreased between 30% to 55%, in the feature matching stage. Moreover, the execution time of the overall algorithms (including the feature extraction and the feature matching) is decreased between 15% to 40% in real scenes. Meanwhile in some cases, the accuracy is increased too. Theoretical investigation and experimental results show that our algorithms have a very good performance with real complex scenes, therefore these new algorithms are very suitable for fast edge-based stereo applications in real scenes like robotic applications. key words: fast edge-based stereo, search spaces reduction, directional derivative of disparity, hierarchical multiresolution

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Effective Parameters in Search Space Reduction Used in a Fast Edge-based Stereo Matching

Reduction of search region in stereo correspondence can increase performances of the matching process, in the context of execution time and accuracy. For an edge-based stereo matching, we establish relationships between the search space and the parameters like relative displacement of edges, disparity under consideration, image resolution, CCD (Charge-Coupled Device) dimension and focal length ...

متن کامل

Search Space Reduction in the Edge Based Stereo Correspondence

Usually, the stereo correspondence for a feature point in the first image is obtained by searching in a predefined region of the second image, based on the epipolar line and the maximum disparity. The reduction of the search space can increase the performance of the matching process, in the co text of the execution time and the accuracy. For the edge-based stereo correspondence, we obtain the n...

متن کامل

Fast Edge - Based Stereo Matching and Geometric Parameters 1

The reduction of the search region in stereo correspondence can improve the performance of the matching process in terms of execution time and accuracy. For the edge-based stereo matching, we establish the relationship between a search space and parameters such as relative displacement of the edges, the disparity under consideration, the image resolution, the CCD dimension, and the focal length...

متن کامل

INDUSTRIAL AND COMMERCIAL APPLICATION Fast spatio-temporal stereo for intelligent transportation systems

This paper presents a fast approach for matching stereoscopic images acquired by stereo cameras mounted aboard a moving car. The proposed approach exploits the spatio-temporal consistency between consecutive frames in stereo sequences to improve matching results. This means that the matching process at current frame uses the matching results obtained at its preceding one. The preceding frame al...

متن کامل

Optimizing Disparity Candidates Space in Dense Stereo Matching

In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002